Literaturverzeichnis

1

literature on Computer-Go


older works

2
(!) Lefkovitz, D., A Strategic Pattern Recognition Program of the Game of Go. Wright Air Development Division techn. Note 60- 243, Univ. of Pennsylvania, The Moore School of Electrical Engineering, Philadelphia,Pennsylvania, 1960.

3
(!) Remus, H., Lernversuche an der IBM 704. In: Lernende Automaten, pp.144-154, 1961.

4
√ Remus, H., Simulation of a Learning Machine for Playing Go. Information Processing 1962, pp.192-194, North Holland, 1963. Auch in: [148], Vol.II, pp.136-142.

5
√ Thorp, Walden. A partial analysis of Go. Computer Journal, Vol.7 No.3, pp. 203-207, 1964. Auch in: [148], Vol.II, pp.143-151.

6
√ Thorp, Walden. A Computer assisted Study of Go on m×n boards. Inf. Sciences, Vol.4 No.1, pp.1-33, 1972. Auch in: [98], pp. 303-343 und in: [148], Vol.II, pp.152-181.

7
(!) Uhr, L., Programs for the Japanese Game of Go. Pattern Recognition, Learning and Thought, Prentice Hall, pp.230-248, 1973.

8
√ Wimmer,M. Computer und Go. In: Die Treppe, 1965.

9
√ Zobrist,A.L. Feature extraction and representation for pattern recognition and the game of Go. Doctoral Dissertation, The University of Wisconsin, 1970. Microfilm No.71-3,162.

10
(!) Zobrist, A.L., A Model of Visual Organisation for the Game of Go. Proceedings AFIPS Spring Joint Computer Conference, Vol.34, pp.103-112, 1969.


newer works

11
Benson, D.B., Soule, S.P. , Legal Go: A formal program specification. WSU, Pullman, Washington, 1978.

12
√ Benson, D.B., Life in the Game of Go. Information Sciences, Vol.10, pp.17-29, 1976. Auch in: [148], Vol.II, pp.203-213.

13
Benson, D.B., Starkey, J.D., The Game of Go on the Computer. In: Proc. ACM-CIPS Pacific Regional Symposium, 1976.

14
Benson, D.B., Computerizing the Game of Go. Techn. rep. CS-76-31, Comp.Sci.Department, WSU, Pullman, 1976.

15
√ Benson, D.B., Hilditich, B.R., Starkey, J.D., Tree Analysis Techniques in Tsumego. In: Proc. IJCAI, pp.50-52, 1979, und in: [148], Vol.II, pp.265-269.

16
Brown, D.J.H. Hierarchical Reasoning in the Game of Go. Proc. IJCAI 6, pp.114-116, 1979.

17
Brown, D.J.H., Seeing is Believing ( or How to Make Sabaki ). In: [145], pp.177-184.

18
Brown, D.J.H., A Computational Model of Reasoning. Report, Conf. Comp. Soc. of South Africa, 1979.

19
Brown, D.J.H., Reasoning about Games. AISB Newsletter, Vol.32, pp.14-17, 1978.

20
Brown, D.J.H., Computer Games - Is Go harder than Chess ? In: Personal Computing 12, pp.81-83, 1979.

21
Brown, D.J.H., Dowsey, S., The Challenge of Go. New Scientist, Vol.81, pp.303-305, 1979.

22
√ Evers, P., The Planning Structure for the Beginning Game of Go. Proc. ACM-CIPS, June 1976.

23
√ Friedenbach, K.J. Abstraction Hierarchies: A Model of Perception and Cognition in the Game of Go. Dissertation, Univ. of California, Santa Cruz, 1980. ( Microfilm )

24
(!) Gottschalk, G.F., Game Playing - the Ancient Game of Go. MA-Thesis, Naval Postgraduate School, Monterey, California, Ad 741134.

25
(!) Kerwin, J., Reitman, W., Video Game No.3: A Go Protocol with Comments. Unpublished Paper, Uni. of Michigan, Mental Health Research Institute, 1973.

26
(!) Lehner, P.E., Planning in Adversity: A Computational Model of Strategic Planning in the Game of Go. PhD Dissertation, Univ. of Michigan, 1981.

27
√ Lehner, P.E., Strategic Planning in Go. In: [145], pp.167-176.

28
√ Mano, Y., An approach to conquer difficulties in developing a Go playing program. Journal of Information Processing, 7, no.2, pp.81-88, 1984. Auch in: [148], Vol.II, pp.248-264.

29
√ Miller, J., The End Game of Go. In: [143].

30
√ Reitman,W. and Wilcox,B. A Program for playing Go: Interim Report. The University of Michigan, Ann Arbor,1976.

31
√ Reitman,W. and Wilcox,B. The Structure and performance of the Interim.2 Go program,1980. Proc. of the 6th International Joint Conference on Artificial Intelligence. IJCAI, Tokyo 1979, pp.711-719. Auch in: [147], pp.105-124, und in: [148], Vol.II, pp.234-247.

32
√ Reitman,W. and Wilcox,B. Perception and representation of spatial relations in a program for playing Go. Proc. of the 30th National Conference of the Association for Computing Machinery, 1975. pp.37-41. Auch in: [148], Vol.II, pp.192-202.

33
√ Reitman, W. and Wilcox, B. , Pattern Recognition and Pattern-Directed Inference in a Program for Playing Go. In: [125], pp.503-523, und in: [148], pp.214-233.

34
(!) Reitman, W. and Wilcox, B. , Modelling Tactical Analysis and Problem Solving in Go. Proc. of the Tenth Annual Pittsburgh Conference on Modelling and Simulation, pp. 2133-2148, 1979.

35
√ Reitman, W., et al., Goals and Plans in a Program for Playing Go. Proc. 29th ACM Conference, pp.123-127, 1974. Auch in: [148], Vol.II, pp.182-191.

36
(!) Reitman, W., Nado, R., Wilcox, B., Machine Perception: What makes it so hard for Computers to see? In: Savage (Ed.), Perception and Cognition, University of Minnesota Press, Minneapolis, pp.65-87, 1978.

37
√ Ryder,J.L. Heuristic analysis of large trees as generated in the game of go. Doctoral dissertation, Stanford University, 1971. Microfilm No. 72-11,654.

38
(!) Sander, P.T., A Strategic Approach to the Game of Go. M.Sc.Thesis, Uni. of Western Ontario, Dept. of Computer Science.

39
(!) Sanechika, N., Ohigashi, H., Mano, Y., Sugawara, Y., Torii, K., Notes on Modelling and Implementation for the Human Player's Decision Processes in the Game of Go. Bull. Electr.Techn.Lab. (Japan), Vol.45, No.1-2, pp.1-11, 1981.

40
Sanechika, N., Recent Developments in Game Playing Programs ( in japanischer Sprache). Information Processing, 20, no.7, pp.601-611, 1979.

41
Sanechika, N., A model of evaluating moves in the Game of Go. Proc. of the 22nd Convention of the Information Processing Society of Japan, 1981.

42
Sanechika, N., Programming the Decision Process in Go.(in japanischer Sprache) Techn. Report of the Information Processing Society of Japan, June 1982.

43
√ Starkey, J.D. The X-O-O Heuristic in Game Tree Analysis. In: [143]

44
Soule, S., The Implementation of a Go Board. Inf. Sciences, Vol.16, pp.31-40, 1978.

45
Sugawara, Y. and Sanechika, N., A method to recognize the strength situation in a Go program ( in japanischer Sprache). Proc. of the 23rd National Conference of the Information Processing Society of Japan, 1981.

46
√ Tackett, M., A pattern recognition approach to tesuji programming in Go. In:[143].


recent works

47
√ Haider, C., Anwendung von Verfahren des Maschinellen Lernens auf das japanische Brettspiel Go, Diplomarbeit, TU Berlin, 1988.

48
(!) Kierulf, A., Merkle, M., Nievergelt, J., A Smart Go Board, its Applications, Algorithms for Tactical Calculator, User Manual. Several Unpublished Papers, ETH Zürich, 1984/85


articles

49
Aroutcheff, P., Atari en Basic, Jeux et Strategie, No.31, pp.18-19, 1985.

50
Block, H.C., Axioms for Go. ACM SIGART Newsletter, no.51, pp.13-14, 1975.

51
Bradley, M.B., The Game of Go - The Ultimate Programming Challenge ? Creative Computing, pp.89-99, March 1979.

52
Dowsey, S., Go and the Computer. Go Review, Vol.13 No.3, pp.72-74, March 1973.

53
√ Fairbairn, J. The 1984 Acornsoft Computer Go Tournament. In: [74] Nr.35, pp.8-11, 1984.

54
Good, I.J., The mystery of Go. In: New Scientist, No.427 ( January 21st ), pp.172-174, 1965. Auch in: [148], Vol.II, pp.87-93.

55
Hamann, C.M., Chronologie der Programmierung des Japanischen Brettspiels Go - Eine Herausforderung an die künstliche Intelligenz. Angewandte Informatik, 12/85, pp.501-511, 1985.

48
√ Kierulf,A. and Nievergelt,J., Computer Go: A Smart Go Board and its Applications. In: [74], No.42, pp62-64, Winter 1985/86.

56
Mann, B., Computer Games - Analysis of a Game. Personal Computing, Vol.3, No.6, pp.83-86.

57
√ Millen, J.K., Programming the Game of Go. Byte, Vol.6 No.4, pp.102-120.

58
√ Scarff, A., Intelligentes Go? in: [70], Heft 5/85, pp.20-23, (1985).

59
√ Interview mit A.Scarff: The Bard of Computer Go, by Jonathan Wood, in: [74], No.46, pp.9-13, Winter 1986/87.

60
Shannon, C.E., Automatic chess Player. In: Scientific American, pp.48-51, February 1950.

61
√ Takagawa Shukaku, Honorary Honinbo, How Many Moves is it Possible to Read ? in: [74], No.41, pp.30-33, Autumn 1985.

62
√ Ting, C.H., Go in Forth. Dr. Dobb's Journal, No. 83, pp. 54 - -65, September 1983.

63
Webster, B.F., A Go Board for the Macintosh. Byte, Vol.9, pp.125-128, 434-448, November 1984.

64
√ Wilcox,B. Computer Go. In: [66], 13:4-6, 14:1, 14:5-6 (1979/80). Auch in: [148], Vol. II, pp.94-135.

65
√ Wilcox, B., Instant Go. In: [66], 12:5-6 bis 14:5-6.


general go-books

66
(!) American Go Journal, P.O.Box 397, Old Chelsea Station, New York, N.Y. 10113.

67
√ Davies, J. , Die chinesischen Go-Regeln. In: [70], 3-6/1987, 1-3/1988.

68
√ Davies, J. , Life and Death. Ishi Press, 1975.

69
√ Davies, J. , Tesuji. Ishi Press, 1975.

70
√ Deutsche Go-Zeitung. Herausgegeben vom Deutschen Go Bund e.V., Postfach 60 54 54, D-2000 Hamburg 60, BRD.

71
√ Congres Europeen de Go 1987. Herausgegeben von der EGF, 1987.

72
Die großen Meister des japanischen Go( In japanischer Sprache ).
√ Band 13: Ito Showa und Ota Yuzo. Kommentar von Hashimoto Shoji 9-Dan.
√ Band 17: Shuei. Kommentar von Takagawa Honinbo.
√ Band 18: Shusai. Kommentar von Sakakibara 9-Dan.

73
√ Fujisawa, S., Reducing Territorial Frameworks. Ishi Press, Tokyo, 1986.

74
√ Go World. Erscheint vierteljährlich. The Ishi Press, Inc. CPO Box 2126, Tokyo, Japan.

75
√ Haruyama, I. and Nagahara, Y., Basic Techniques of Go. Ishi Press, Tokyo, 1969.

76
√ Ing, C.K., The SST Laws of Wei-Ch'i, Eleventh Edition. Ing Chang-Ki Wei-Ch'i Educational Foundation, 1986.

77
√ Ishida, A. and Davies, J., Attack and Defense. Elementary Go Series, Vol.5, Ishi Press, Tokyo, 1980.

78
√ Ishida, Y. Dictionary of Basic Joseki. Vol.1-3. Ishi Press, Tokyo, 1977.

79
√ Iwamoto, K., Go. Goldmann, 1984.

80
Iwamoto, K., The 1971 Honinbo Tournament. Ishi Press, 1972.
81
√ Kageyama, T. Lessons in the Fundamentals of Go. Ishi Press, Tokyo, 1978.

82
√ Kageyama, T., Kage's Secret Chronicles of Handicap Go. Ishi Press, Tokyo, 1975.

83
Kano, Y., Graded Go Problems for Beginners, Vol. I - IV, Nihon Kiin, 1987.

84
Kajiwara, T., The Direction of Play. Ishi Press, 1979.

85
Kato, M., Kato's Attack and Kill. Ishi Press, 1978.

86
Koulen, M., Go - Die Mitte des Himmels. DuMont, 1986.

87
Miyamoto, N., The Breakthrough to Shodan. Ishi Press, 1976.

88
Ohira, S., Appreciating famous Games. Ishi Press, 1977.

89
Power, J. ( Ed. ), Invincible, The Games of Shusaku. Kiseido Publishing Co., 1982.

90
√ Sakata, E., Modern Joseki and Fuseki, Vol. 1+2. Ishi Press, Tokyo, 1970.

91
√ Sakata, E., The Middle Game of Go, Vol.1. Ishi Press, 1971.

92
√ Takagawa S., The Power of the Star Point. Ishi Press, 1988.

93
Takemiya, M., Enclosure Josekis, Ishi Press, 1983.


general game-playing literature

94
Akl, S.G., and Newborn, M.M., The Principal Continuation and the Killer Heuristic. Proc. ACM Nat. Conf., Seattle, pp. 466-478, 1977.

95
Akl, S.G., and Doran, R.J., A comparison of parallel implementations of the alpha-beta and scout tree searching algorithms using the game of checkers. In: [145], pp.290-303, 1983.

96
Banerji, R.B., and Ernst, G.W., Changes in representation which preserve strategies in games. Proc. of 2nd IJCAI, pp 651-658, 1971.

97
Banerji, R.B., and Ernst, G.W., Strategy construction using homomorphisms between games. Artificial Intelligence, 3, pp.223-250, 1972.

98
Banerji, R.B., and Mesarovic, Non numerical problem solving, Springer, 1970.

99
Baudet, G.M., On the branching factor of the alpha-beta pruning algorithm. Artificial Intelligence, 9, pp.177-199, 1978.

100
Berliner, H.J., An examination of brute force intelligence, in: Proceedings IJCAI-81, Vancouver, 1981.

101
Berliner, H.J., The B* tree search algorithm: A best first proof procedure, Artificial Intelligence 12, pp.23-40, 1979.

102
Berliner, H.J., Chess as problem solving: The development of a tactics analyzer. Unpublished Doctoral Thesis, Carnegie-Mellon University, Pittsburgh, 1974. Chapter 1 in: [149], 1988.

103
√ Berliner, H.J., and Campbell, M.S., Using Chunking to solve Chess Pawn Endgames. Artificial Intelligence, .

104
√ Botvinnik, M.M., Computers in Chess: Solving Inexact Search Problems. Springer, 1984.

105
Bratko, I., Knowledge-based problem solving in AL3. Machine Intelligence 10 ( Eds. Hayes, J.E., Michie, D., Pao, Y.-H. ), Ellis Horwood, 1982. Auch in: [145], pp.63-86 ( abgekürzte Fassung ).

106
Campbell, M.S., Marsland, T.A., A Comparison of Minimax Tree Search Algorithms. Artificial Intelligence 20(4), pp.347-367, 1983.

107
DeGroot, A.D., Thought and Choice in Chess. Mouton, den Haag, 1965. Kapitel VII A wiedergegeben in [149].

108
Frey, P.W. (Ed.), Chess Skill in Man and Machine. 2nd Edition, Springer Verlag, 1983.

109
√ Frey, P.W., The alpha-beta algorithm: Incremental updating, well behaved evaluation functions, and non-speculative forward pruning. In [145], pp.285-289.

110
Harris, L.R., The heuristic search: An alternative to the alpha-beta minimax procedure. In: [108], pp.157-167, 1977.

111
Knuth, D.E., and Moore, R.W., An analysis of alpha-beta pruning. Artificial Intelligence 6, pp.293-326, 1975.
112
√ McAllester, D.A., Conspiracy Numbers for Min-Max Search, Artificial Intelligence 35, pp.287-310, 1988.

113
Nau, D.S., An Investigation of the Causes of Pathology in Games. Artificial Intelligence 19, pp.257-278, 1982 .

114
Nau, D.S., The Last Players Theorem. Artificial Intelligence 18, pp.53-65, 1982 .

115
Nau, D.S., Pathology on Game Trees revisited and an alternative to minimaxing. Artificial Intelligence 21 (1-2), pp.221-244, 1983.

116
Nilsson, N.J., Principles of Artificial Intelligence. Tioga, 1980.

117
Palay, A.J., The B* tree search algorithm - New Results, Artificial Intelligence 19, pp.145-163, 1982.

118
Pearl, J. ( Ed. ), Search and Heuristics ( Reprints aus Artificial Intelligence, Vol.21, No. 1,2). North Holland, 1983.

119
Pearl, J., Heuristics. Addison-Wesley, 1985.

120
Roizen, I. and Pearl, J., A minimax algorithm better than alpha-beta? Yes and no, Artificial Intelligence 21, pp.199-220, 1983.

121
√ Rosenbloom, P.S., A World-Championship-Level Othello Program. Artificial Intelligence 19, pp.279-320. Auch in: [148].

122
Samuel, A.L., Some studies in machine learning using the game of Checkers. IBM Journal of Research and Development, 3, No.3, 210-229, 1959.

123
Samuel, A.L., Some studies in machine learning using the game of Checkers. II - Recent progress. IBM Journal of Research and Development, 11, No.6, 601-618, 1967.

124
Stockman, G., A minimax algorithm better than alpha-beta? Artificial Intelligence 12, pp.179-196, 1979.

125
(!) Waterman, D.A. and Hayes-Roth, F. ( Eds.), Pattern-Directed Inference Systems. Academic Press, 1978.

126
√ Zahle, T.U., A Program of Master Strength to Play 5 in a Row. EURO IFIP ( Editor: Samet P.A.) ,North Holland, 1979.

127
Wilkins, D.E, Using Patterns and Plans to solve Problems and Control Search. Stanford, 1979.


128
Uhr, L.M., and Vossler, C., A Pattern Recognition Program that generates, evaluates, and adjusts its own Operators. Proceedings of the Western Joint Computer Conference, pp.555-569, 1961.


mathematical, game-oriented literature

129
√ Aigner, M., Graphentheorie. Teubner, 1984.

130
√ Benson, D.B., A Mathematical Analysis of Go. In: [147], pp.55-64.

131
(!) Fraenkel, A.S., From Nim to Go. Annals of Discrete Mathematics, Vol.6, pp.137-156, 1978.

132
√ Hanner, O. , Mean Play of Sums of Positional Games, Pacific Journal of Mathematics, Vol.9 No.1, pp.81-99, 1959.

133
(!) Kim, J.B., On the Game of Go. Kyungpook Math. Journal, pp.125-134, 1978.

134
√ Lenz, K.F., Die Semeai-Formel. In: [70], 57. Jahrgang, Nr.4, Juli/August 1982.

135
(!) Lichtenstein, D., Sipser, M., Go is polynomial space hard. Journal ACM, Vol.27, No.2, pp.393-401, April 1980.

136
Liu, S.C., A mathematical theory of Wei-ch'i ( or the Game of Go ). In: Memorial Volume to President Chiang Kai-Shek. Acad. Sinica, Taipei, Taiwan, pp.75-108, 1976.

137
Liu, S.C., Discussion on an earlier Paper on a Mathematical Theory of the Game Wei-ch'i ( Go ). In: Essays, Comm. of the Golden Jubilee of Academia Sinica, Taipei, Taiwan, pp.133-188, 1978.

138
(!) Milnor, J. , Sums of Positional Games. In: Contributions to the Theory of Games (Eds. Dresher, M., Tucker, A.W., Wolfe), Vol. II, pp.291-301, Princeton University Press, 1953.

139
(!) Morris, F.L., Playing Disjunctive Sums is Polynomial Space Complete. Int. Journal Game Theory, Vol.10, No.3-4, pp.195-205, 1981.

140
(!) Olmstead, J.H.M. and Robinson, K.D., A treatise on the Rules of Go. Go Monthly Review, 4, No.9, pp.87-103, 1964.

141
√ Robson, J.M., The Complexity of Go. In: Information Processing 83 ( Ed. Mason, R.E.A. ), North Holland, 1983.

142
√ Wolff, M., Group Diagrams in Go. In [66] (?).


last but not least

143
Proc. ACM-CIPS Pacific Regional Symposium, June 1976.

144
Berliner, H.J., A Chronology of Computer Chess and its Literature. Artificial Intelligence, No.10, pp.201-214, 1978.

145
√ Bramer, M.A., Computer Game Playing: Theory and Practice. Ellis Horwood Ltd., 1983.

146
Computer Go, Editor: David Erbach, 71 Brixford Crescent, Winnipeg, Manitoba R2N 1E1, Canada.

147
√ Heine, K. (ed.) Proceedings of IInd Seminar of Scientific Go-Theory. Institut für Strahlenchemie, Mühlheim a.d. Ruhr, 1980.

148
√ Levy, D.N.L. (Editor), Computer Games I+II,Springer, 1988.

149
(!) Levy, D.N.L., Compendium of Computer Chess. Batsford, London, 1988.